Use of Crossing-State Equivalence Classes for Rapid Relabeling of Knot-Diagrams Representing 21/2D Scenes

نویسندگان

  • Keith Wiley
  • Lance R. Williams
چکیده

In our previous research, we have demonstrated a sophisticated computer-assisted drawing program called Druid, which permits easy construction of 21/2D scenes. A 21/2D scene is a representation of surfaces that is fundamentally two-dimensional, but which also represents the relative depths of those surfaces in the third dimension. This paper improves Druid’s efficiency by exploitating a topological trait of 21/2D scenes called a crossing-state equivalence class. This paper describes this trait and how it is used by Druid.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Combinatorial Revolution in Knot Theory

K not theory is usually understood to be the study of embeddings of topological spaces in other topological spaces. Classical knot theory, in particular, is concerned with the ways in which a circle or a disjoint union of circles can be embedded in R. Knots are usually described via knot diagrams, projections of the knot onto a plane with breaks at crossing points to indicate which strand passe...

متن کامل

Minimal Surface Representations of Virtual Knots and Links

Equivalence classes of virtual knot diagrams are in a one to one correspondence with knot diagrams (decorated immersions of S1) in orientable, closed surfaces modulo stable handle equivalence and Reidemeister moves. Each virtual knot diagram corresponds to a diagram in a unique minimal surface. If a virtual knot diagram is equivalent to a classical knot diagram then this minimal surface is a sp...

متن کامل

The Almost Alternating Diagrams of the Trivial Knot

Bankwitz characterized an alternating diagram representing the trivial knot. A non-alternating diagram is called almost alternating if one crossing change makes the diagram alternating. We characterize an almost alternaing diagram representing the trivial knot. As a corollary we determine an unknotting number one alternating knot with a property that the unknotting operation can be done on its ...

متن کامل

The Number of Reidemeister Moves Needed for Unknotting

A knot is an embedding of a circle S in a 3-manifold M , usually taken to be R or S. In the 1920’s Alexander and Briggs [2, §4] and Reidemeister [23] observed that questions about ambient isotopy of polygonal knots in R can be reduced to combinatorial questions about knot diagrams. These are labeled planar graphs with overcrossings and undercrossings marked, representing a projection of the kno...

متن کامل

On the Jones Polynomial and Its Applications

This paper is a self-contained introduction to the Jones polynomial that assumes no background in knot theory. We define the Jones polynomial, prove its invariance, and use it to tackle two problems in knot theory: detecting amphichirality and finding bounds on the crossing numbers. 1. Preliminaries 1.1. Definitions. For the most part, it is enough to think of a knot as something made physicall...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006